|
In mathematics, a Hamiltonian matrix is a -by- matrix such that is symmetric, where is the skew-symmetric matrix : and is the -by- identity matrix. In other words, is Hamiltonian if and only if where denotes the transpose.〔.〕 ==Properties== Suppose that the -by- matrix is written as the block matrix : where , , , and are -by- matrices. Then the condition that be Hamiltonian is equivalent to requiring that the matrices and are symmetric, and that .〔〔.〕 Another equivalent condition is that is of the form with symmetric.〔 It follows easily from the definition that the transpose of a Hamiltonian matrix is Hamiltonian. Furthermore, the sum (and any linear combination) of two Hamiltonian matrices is again Hamiltonian, as is their commutator. It follows that the space of all Hamiltonian matrices is a Lie algebra, denoted . The dimension of is . The corresponding Lie group is the symplectic group . This group consists of the symplectic matrices, those matrices which satisfy . Thus, the matrix exponential of a Hamiltonian matrix is symplectic. However the logarithm of a symplectic matrix is not necessarily Hamiltonian because the exponential map from the Lie algebra to the group is not surjective.〔〔.〕 The characteristic polynomial of a real Hamiltonian matrix is even. Thus, if a Hamiltonian matrix has as an eigenvalue, then , and are also eigenvalues.〔 It follows that the trace of a Hamiltonian matrix is zero. The square of a Hamiltonian matrix is skew-Hamiltonian (a matrix is skew-Hamiltonian if ). Conversely, every skew-Hamiltonian matrix arises as the square of a Hamiltonian matrix.〔.〕 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Hamiltonian matrix」の詳細全文を読む スポンサード リンク
|